package leetcode_2501_2600;

import java.lang.reflect.AnnotatedArrayType;
import java.util.ArrayList;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;

public class LeeCode_2571 {
    public static void main(String[] args) {
//        System.out.println(minOperations2(39));
        System.out.println(5 & -5);
    }
    private static int minOperations(int n) {
        int ans = 1;
        while ((n & (n - 1)) > 0){
            int lb = n & -n;
            if ((n & (lb << 1)) > 0){
                n += lb;
            }else {
                n -= lb;
            }
            ans++;
        }
        return ans;
    }
}
